Sorting with forbidden intermediates
نویسندگان
چکیده
منابع مشابه
Sorting with Forbidden Intermediates
A wide range of applications, most notably in comparative genomics, in-volve the computation of a shortest sorting sequence of operations for a givenpermutation, where the set of allowed operations is fixed beforehand. Suchsequences are useful for instance when reconstructing potential scenarios ofevolution between species, or when trying to assess their similarity. We revisit<l...
متن کاملSorting Under Forbidden Comparisons
In this paper we study the problem of sorting under forbidden comparisons where some pairs of elements may not be compared (forbidden pairs). Along with the set of elements V the input to our problem is a graph G(V,E), whose edges represents the pairs that we can compare in constant time. Given a graph with n vertices and m = ( n 2 ) − q edges we propose the first nontrivial deterministic algor...
متن کاملGraphs with Forbidden Subgraphs
Many graphs which are encountered in the study of graph theory are characterized by a type of configuration or subgraph they possess. However, there are occasions when such graphs are more easily defined or described by the kind of subgraphs they are not permitted to contain. For example, a tree can be defined as a connected graph which contains no cycles, and Kuratowski [22] characterized plan...
متن کاملtreatment with muḥarramāt (forbidden things)
the jurists have since early times wondered whether illnesses can be treated with forbidden or ḥarām things and thereby improve the illness and restore the patients to health; or whether it is totally forbidden and impermissible to step into this arena even if motivated by treatment of illness. of course, using the unlawful in treating illnesses where exploitations other than eating and drinkin...
متن کاملSet families with forbidden subposets
Let F be a family of subsets of {1, . . . , n}. We say that F is P -free if the inclusion order on F does not contain P as an induced subposet. The Turán function of P , denoted La∗(n, P ), is the maximum size of a P -free family of subsets of {1, . . . , n}. We show that La∗(n, P ) ≤ (4r + O( √ r)) ( n bn/2c ) if P is an r-element poset of height at most 2. We also show that La∗(n, Sr) = (r + ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2020
ISSN: 0166-218X
DOI: 10.1016/j.dam.2019.10.025